منابع مشابه
Smallest Horn Clause Programs
The simplest non{trivial program pattern in logic programming is the following one : 8 < : p(fact) : p(left) p(right) : p(goal) : where fact, goal, left and right are arbitrary terms. Because the well known append program matches this pattern, we will denote such programs \append{like". In spite of their simple appearance, we prove in this paper that termination and satissability (i.e the exist...
متن کاملGeneralized Horn Clause Programs
This paper considers, in a general setting, an axiomatic basis for Horn clause logic programming. It characterizes a variety of \Horn-clause-like" computations, arising in contexts such as deductive databases, various abstract interpretations, and extensions to logic programming involving E-uniication, quantitative deduction, and inheritance, in terms of two simple operators , and discusses alg...
متن کاملProving Horn Clause Specifications of Imperative Programs
We present a method for verifying the correctness of an imperative program with respect to a specification defined in terms of a set of possibly recursive Horn clauses. Given a program prog, we consider a partial correctness specification of the form {φ} prog {ψ}, where the assertions φ and ψ are predicates defined by a set Spec of Horn clauses. The verification method consists in: (i) encoding...
متن کاملHorn Clause Programs with Polymorphic Types: Semantics and Resolution
This paper presents a Horn clanse logic where functions and predicates are declared with polymorphic types. Types are parameterized with type variables. This leads to an ML-like polymorphic type system. A type declaration of a function or predicate restricts the possible use of this function or predicate so that only certain terms are allowed to be arguments for this function or predicate. The ...
متن کاملA Three-Valued Semantic for Horn Clause Programs
The study of semantics of logic programs has shown strong links between the model theoretic semantics (truth and falsity of atoms in the programmer's interpretation of a program), procedural semantics (for example, SLD resolution) and xpoint semantics (which is useful for program analysis and alternative execution mechanisms). Nearly all of this work assumes that intended interpretations are tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1996
ISSN: 0743-1066
DOI: 10.1016/0743-1066(95)00122-0